Evolving Graph Databases under Description Logic Constraints
نویسندگان
چکیده
In the setting of graph-structured data, description logics are well suited to impose constraints that capture the semantics of the domain of interest. When the data evolves as a result of operations carried out by users or applications, it is important to ensure that the satisfaction of the constraints is preserved, analogously to the consistency requirement for transactions in relational databases. In this paper we introduce a simple action language in which actions are finite sequences of insertions and deletions performed on concept/roles, and we study static verification in this setting. Specifically, we address the problem of verifying whether the constraints are still satisfied in the state resulting from the execution of a given action, for every possible initial state satisfying them. We are able to provide a tight coNExpTime bound for a very expressive DL, and show that the complexity drops to coNP-complete for the case of DL-Lite.
منابع مشابه
Verification of Evolving Graph-structured Data under Expressive Path Constraints
Integrity constraints play a central role in databases and, among other applications, are fundamental for preserving data integrity when databases evolve as a result of operations manipulating the data. In this context, an important task is that of static verification, which consists in deciding whether a given set of constraints is preserved after the execution of a given sequence of operation...
متن کاملWhat can Knowledge Representation do for Semi-Structured Data?
The problem of modeling semi-structured data is important in many application areas such as multimedia data management, biological databases, digital libraries, and data integration. Graph schemas (Buneman et al. 1997) have been proposed recently as a simple and elegant formalism for representing semistructured data. In this model, schemas are represented as graphs whose edges are labeled with ...
متن کاملIntegrating Description Logics and Relational Databases
In this paper, we compare description logics with relational databases with respect to their treatment of schema constraints, the languages used to express these constraints, and the approaches to query answering and constraint checking. Our analysis reveals a significant overlap between the two formalisms. Inspired by the integrity constraints of relational databases, we define a notion of int...
متن کاملEGG: A Framework for Generating Evolving RDF Graphs
We demonstrate EGG (Evolving Graph Generator), an opensource framework for generating evolving RDF graphs based on finelytuned temporal constraints given by the user. During the demonstration, we will showcase the highly-expressive constraints that the user can specify in EGG to generate evolving graphs over various real-world use cases, the accuracy and scalability of the generator, and the ea...
متن کامل